#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int T;
string s;
int t[26];

inline void solution() {
    cin >> T;
    for (int i = 1; i <= T; i ++ ) {
        mm(t, 0);
        cin >> s;
        for (int j = 0; j < s.size(); j ++ ) {
            t[s[j] - 'a'] ++;
        }
        int m = -INF;
        for (int j = 0; j < 26; j ++ ) 
            m = max(m, t[j]);
        printf("Case #%d: %d\n", i, m);
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}